MIME-Version: 1.0
Server: CERN/3.0
Date: Monday, 06-Jan-97 21:57:52 GMT
Content-Type: text/html
Content-Length: 6780
Last-Modified: Tuesday, 05-Dec-95 21:24:02 GMT

<HTML>
<!--  syllabus.html          P. Manolios           28 Aug 95    -->
<HEAD>
<TITLE>CS 380D: Distributed Computing I Syllabus</TITLE>
</HEAD>

<BODY>
  <H1>CS 380D: Distributed Computing I</H1>
  <H4>Fall 1995  |  Professor: Jayadev Misra  | TA: Panagiotis
      (Peter) Manolios</H4>
  <HR>

  <H2>COURSE SYLLABUS</H2>
  <dl><dt><a name="ToC"><b>TABLE OF CONTENTS</b></a></dl>
  <ol>
    <li><!WA0><a href="#CrsInfo">Course information</a>
    <li><!WA1><a href="#Time&Loc">Meeting time and location</a>
    <li><!WA2><a href="#Instructor">Instructor</a>
    <li><!WA3><a href="#TA">Teaching Assistant</a>
    <li><!WA4><a href="#CrsTopics">Course Topics</a>
    <li><!WA5><a href="#Discuss">Discussion Sessions</a>
    <li><!WA6><a href="#Groups">Study Groups</a>
    <li><!WA7><a href="#Grades">Grading system</a>
    <li><!WA8><a href="#Exams">Exams</a>
    <li><!WA9><a href="#Reading">Reading material</a>
    <li><!WA10><a href="#Announcements">Announcements</a>
  </ol> <p>

  <h2><a name="CrsInfo">Distributed Computing I</a></h2>

  <b>Unique number:</b> 47680.<br>
  <b>Course number:</b> C S 380D.<br>
  <b>Prerequisite:</b> C S 372.<p>

  <h2><a name="Time&Loc">Meeting time and location</a></h2>
  <b>Days:</b> Tue, Thr<br>
  <b>Time:</b>  11:00-12:30 AM<br>
  <b>Place:</b> WEL 2.256
  <p>

  <h2><a name="Instructor">Instructor</a></h2>
  <b>Name</b>: <!WA11><a href="http://www.cs.utexas.edu/users/misra/index.html">Professor
		Misra</a><br>
  <b>Office: </b>Tay 3.150C<br>
  <b>Office hours:</b> Tue, Thr 2:30-3:30 PM or by appointment <br>
  <b>Phone:</b> 512-471-9550<br>
  <b>Email:</b> 
    <i> 
      <!WA12><a href="mailto: misra@cs.utexas.edu">misra@cs.utexas.edu</a>
    </i>
  <p>

  <h2><a name="TA">Teaching Assistant</a></h2>
  <b>Name</b>: Panagiotis (Peter) Manolios<br>
  <b>Office: </b>Tay 5.112<br>
  <b>Phone:</b> 512-471-9575<br>
  <b>Email:</b> 
    <i> 
      <!WA13><a href="mailto: pete@cs.utexas.edu">pete@cs.utexas.edu</a>
    </i> <br>
  <b>Discussion Sessions:</b> Mon. 5:00-6:00PM, Fri. 10:00-11:00AM in PAI 5.60<br>
  <b>Office hours:</b> Mon. 6:00-7:00PM, Fri. 11:00-Noon in Pai 5.60<br>
  <p>

  <h2><a name="CrsTopics">Course Topics</a></h2>
  The goal of this course is to present a number of important ideas in
  distributed computing and provide rigorous methods for reasoning about
  distributed programs. The topics are:
  <ul>
    <li> Distributed detection algorithms
    <li> Distributed resource allocation
    <li> Logical clocks
    <li> Global snapshot
    <li> Logics for reasoning about distributed algorithms
    <li> Safety and progress
    <li> Program composition
    <li> Distributed program construction
  </ul>
  <p>

  <h2><a name="Discuss">Discussion Sessions</a></h2>
  The discussion sessions will allow us to discuss topics presented in class in
  detail and on occasion to cover background material. Weekly handouts 
  containing exercises will be distributed (in class and on the Web) and 
  selected solutions will be 
  presented during the discussion sessions. You only need attend one of the
  weekly sessions; both cover the same material.

  <h2><a name="Groups">Study Groups</a></h2>
  We recommend that you organize yourselves into study groups of five or six
  students who meet once a week to discuss the course. You should review the
  lectures, do the readings, and attempt the homework assignments before 
  meeting as a group.

  <h2><a name="Grades">Grading system</a></h2>
  <ul>
    <li>First exam = 25%
    <li>Second exam = 37.5%
    <li>Third exam = 37.5%
  </ul>
  <p>

  <h2><a name="Exams">Exams</a></h2>
  <ul>
    <li> October 3, 1995 in Sachez Building (SZB) 370 from 11AM-1PM
    <li> November 2, 1995 in Garrison (GAR) 7 from 11AM-12:50PM
    <li> December 7, 1995 in Garrison (GAR) 7 from 11AM-12:50PM
  </ul>
  <p>

  <h2><a name="Reading">Reading material</a></h2>
  <h3>Books</h3>
  <ul>
    <li><i>Parallel Program Design: A Foundation</i> by K. Mani Chandy
        and Jayadev Misra, Addison-Wesley, 1988.
    <li>(for reference)<i>Predicate Calculus and Program Semantics</i>
        by Edsger W. Dijkstra and Carel S. Scholten, Springer-Verlag, 1990.
    <li>(for reference)<i>Fairness</i>
        by N. Francez, Springer-Verlag, 1986.
  </ul>
  <p>

  <h3>Papers (tentative)</h3>
  <ul>


    <li> Leader Election in Rings
    <li> Termination Detection for Diffusing Computations
    <li> <!WA14><a href="http://www.cs.utexas.edu/users/pete/termination-detection.ps.Z">
	Termination Detection in a Ring</a>
    <li> <!WA15><a href="http://www.cs.utexas.edu/users/pete/termination-detection-references.ps.Z">
	A Partial List of References on Termination Detection</a> 
    <li> The Drinking Philosophers Problem
    <li> Time, Clocks, and the Ordering of Events in a Distributed System
    <li> The Distributed Snapshot of K.M. Chandy and L. Lamport
    <li> <!WA16><a href="http://www.cs.utexas.edu/users/pete/snapshot-references.html">
	References for the Distributed Snapshot of K.M. Chandy and L. Lamport
	</a>
    <li> <!WA17><a href="http://www.cs.utexas.edu/users/pete/program-proving.ps.Z">
	Notes on Program Proving</a>
    <li> An Axiomatic Proof Technique for Parallel Programs I
    <li> Proof of Peterson's Mutual Exclusion Algorithm
    <LI> <!WA18><a href="ftp://ftp.cs.utexas.edu/pub/psp/unity/new_unity/safety.ps.Z">
          Safety </a>
    <LI> <!WA19><a href="ftp://ftp.cs.utexas.edu/pub/psp/unity/new_unity/progress.ps.Z">
          Progress </a>
    <li> Asynchronous Compositions of Programs
  </ul>



  <h2><a name="Announcements">Announcements</a></h2>
  <ol>
    <li>All students should send e-mail to <!WA20><a href ="mailto: pete@cs.utexas.edu"> 
        Panagiotis (Peter) Manolios </a>, so a list of e-mail addresses can be
        compiled.
    <li>The newsgroup <!WA21><a href ="news: utexas.class.cs380d"> utexas.class.cs380d </a>
        has been set up to facilitate discussion between class members.
    <li><b>Drop dates:</b> Please consult the course schedule to learn the
        the last dates to drop the course without academic penalty. 
    <li><!WA22><a href="#Exams">Updated info on rooms and times of exams</a> 
    <li>In a few weeks the University Co-op will begin the process of returning
	unsold Fall textbooks to the publishers, so if you want to purchase any
	of the recommended books and have not yet done so, now is the time.
  </ol>


</BODY>
<hr>

<ADDRESS>
  Last updated 12/5/95<br>
  Page prepared by Panagiotis Manolios. Any suggestions, comments welcome.<br>
  <!WA23><a href ="http://www.cs.utexas.edu/users/pete/CS380D-main.html">Distributed Computing I</a>,
  <!WA24><a href="http://www.cs.utexas.edu/">Department of Computer Sciences</a>
  at <!WA25><a href="http://www.utexas.edu/"> UT Austin </a><p>

  Click to send e-mail to <!WA26><a href="mailto: misra@cs.utexas.edu">
  Prof. Misra</a> or <!WA27><a href="mailto: pete@cs.utexas.edu">
  Panagiotis (Peter) Manolios </a>
</ADDRESS> 

</HTML>


